Heavy-Traffic Limits for a Many-Server Queueing Network with Switchover
نویسندگان
چکیده
منابع مشابه
Heavy-traffic limits for many-server queues with service interruptions
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing customer abandonment (the +M), subject to exogenous regenerative service interruptions. With unscaled service interruption times, we obtain a FWLLN for the queue-length process where the limit is an ordinary differential equation in a two-state random environment. With asymptotically negligible service interru...
متن کاملHeavy Traffic Limits for Some Queueing Networks
Using a slight modification of the framework in Bramson [7] and Williams [52], we prove heavy traffic limit theorems for six families of multiclass queueing networks. The first three families are single station systems operating under first-in first-out (FIFO), generalized headof-the-line proportional processor sharing (GHLPPS) and static buffer priority (SBP) service disciplines. The next two ...
متن کاملHeavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services
We study an infinite-server fork-join queueing system with dependent services, which experiences alternating renewal service disruptions. Jobs are forked into a fixed number of parallel tasks upon arrival and processed at the corresponding parallel service stations with multiple servers. Synchronization of a job occurs when its parallel tasks are completed, i.e., non-exchangeable. Service times...
متن کاملHeavy-traffic Limits for Waiting times in Many-server Queues with Abandonment1 by Rishi Talreja
We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiency-driven (QED) regime, then a bounding argument shows that the abandonment does not affect waiting-time processes. If instead the system is overloaded, as in the efficiency-driven (ED) regime, fo...
متن کاملHeavy-traffic Limits for Waiting times in Many-server Queues with Abandonment
We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiencydriven (QED) regime, then a bounding argument shows that the abandonment does not affect waiting-time processes. If instead the system is overloaded, as in the efficiency-driven (ED) regime, fol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2013
ISSN: 0001-8678,1475-6064
DOI: 10.1017/s0001867800006522